XPi: A typed process calculus for XML messaging
نویسندگان
چکیده
منابع مشابه
XPi: A Typed Process Calculus for XML Messaging
We present XPi, a core calculus for XML messaging. XPi features asynchronous communications, pattern matching, name and code mobility, integration of static and dynamic typing. Flexibility and expressiveness of this calculus is illustrated by a few examples, some concerning description and discovery of web services. In XPi, a type system disciplines XML message handling at the level of channels...
متن کاملA Typed Higher-Order Calculus for Querying XML Databases
As the eXtensible Markup Language (XML) is about to emerge as a new standard for databases, the problem of providing solid logical grounds for XML query languages arises. For the relational data model firstorder logic, i.e. the Relational Calculus turned out to be an intuitive basic approach to provide these foundations. For XML, however, it is necessary to deal with ordered trees. In this pape...
متن کاملA Typed Calculus for Querying Distributed XML Documents
We study the problems related to querying large, distributed XML documents. Our proposal takes the form of a new process calculus in which XML data are processes that can be queried by means of concurrent pattern-matching expressions. What we achieve is a functional, strongly-typed programming model based on three main ingredients: an asynchronous process calculus that draws features from π-cal...
متن کاملAn Implicitly-Typed Deadlock-Free Process Calculus
We extend Kobayashi and Sumii's type system for the deadlock-free -calculus and develop a type reconstruction algorithm. Kobayashi and Sumii's type system helps high-level reasoning about concurrent programs by guaranteeing that communication on certain channels will eventually succeed. It can ensure, for example, that a process implementing a function really behaves like a function. However, b...
متن کاملProof-Carrying Code in a Session-Typed Process Calculus
Dependent session types allow us to describe not only properties of the I/O behavior of processes but also of the exchanged data. In this paper we show how to exploit dependent session types to express proof-carrying communication. We further introduce two modal operators into the type theory to provide detailed control about how much information is communicated: one based on traditional proof ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2008
ISSN: 0167-6423
DOI: 10.1016/j.scico.2008.02.001